x = int(input())
zoop = list(map(int, input().split()))
dp = [1]*len(zoop)
for i in range(1, len(zoop)):
if zoop[i] > zoop[i-1]:
dp[i] = dp[i-1]+1
print(max(dp))
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, inc = 1, mx = 1, a, temp; cin>>n;
for(int i=0; i<n; i++){
if(i==0){
cin>>a;
}else{
cin>>temp;
if(temp>a){
inc++;
}else{
mx = max(mx, inc);
inc = 1;
}
a = temp;
}
}
cout<<max(mx, inc)<<endl;
return 0;
}
734B - Anton and Digits | 1080A - Petya and Origami |
1642D - Repetitions Decoding | 1440A - Buy the String |
1658F - Juju and Binary String | 478A - Initial Bet |
981A - Antipalindrome | 365A - Good Number |
1204B - Mislove Has Lost an Array | 1409D - Decrease the Sum of Digits |
1476E - Pattern Matching | 1107A - Digits Sequence Dividing |
1348A - Phoenix and Balance | 1343B - Balanced Array |
1186A - Vus the Cossack and a Contest | 1494A - ABC String |
1606A - AB Balance | 1658C - Shinju and the Lost Permutation |
1547C - Pair Programming | 550A - Two Substrings |
797B - Odd sum | 1093A - Dice Rolling |
1360B - Honest Coach | 1399C - Boats Competition |
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |